Cluster Mapping with the help of New Extended MCF Algorithm and MCF Algorithm to Recommend an Ice Cream to the Diabetic Patient
نویسندگان
چکیده
The research for suggesting an ice cream for a diabetic patient is carried out in data mining by using clustering and mapping between the data for ice cream and diabetic patients. Here, using MFCA, which is proposed and explained in this paper, does mapping of ice cream dataset with diabetic patient dataset. The results obtained from MCFA algorithm and the new extended MCF algorithm are explained and verified and it is observed that they are having the relevance.
منابع مشابه
Cluster Based Cross Layer Intelligent Service Discovery for Mobile Ad-Hoc Networks
The ability to discover services in Mobile Ad hoc Network (MANET) is a major prerequisite. Cluster basedcross layer intelligent service discovery for MANET (CBISD) is cluster based architecture, caching ofsemantic details of services and intelligent forwarding using network layer mechanisms. The cluster basedarchitecture using semantic knowledge provides scalability and accuracy. Also, the mini...
متن کاملOptimal Operation of Microgrid in the presence of Real-time Pricing Demand Response Program using Artificial Bee Colony Algorithm with a Modified Choice Function
Abstract: Microgrid is one of the newest technologies in power systems. Microgrid can usually has a set of distributed energy resources that makes it able to operate separate from power grid. Optimal operation of microgrids means the optimal dispatch of power resources through day and night hours. This thesis proposed a new method for optimal operation of microgrid. In this method, real-time pr...
متن کاملA New Method for Color Gamut Mapping by Genetic Algorithm
To reproduce an image, it is necessary to map out of gamut colors of the image to destination gamut. It is clear that the best color gamut mapping introduces the perceptually closest image to the original one. In this study, a new color gamut mapping is purposed by the aid of Genetic Algorithm (GA). The color difference between the original and mapped images based on S-LAB formula was chosen as...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کامل